Monotonicity and supermodularity results for the Erlang loss system
نویسندگان
چکیده
For the Erlang loss system with s servers and offered load a, we show that: (i) the load carried by the last server is strictly increasing in a; (ii) the carried load of the whole system is strictly supermodular on {(s, a)|s = 0, 1, . . . and a > 0}.
منابع مشابه
Cold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution
In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...
متن کاملSupermodularity and preferences
We uncover the complete ordinal implications of supermodularity on finite lattices under the assumption of weak monotonicity. In this environment, we show that supermodularity is ordinally equivalent to the notion of quasisupermodularity introduced by Milgrom and Shannon. We conclude that supermodularity is a weak property, in the sense that many preferences have a supermodular representation.
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Supermodularizability
We study the ordinal content of assuming supermodularity, including conditions under which a binary relation can be represented by a supermodular function. When applied to revealed-preference relations, our results imply that supermodularity is some times not refutable: A consumer’s choices can be rationalized with a supermodular utility function if they can be rationalized with a monotonic uti...
متن کاملMonotonicity and error bounds for networks of Erlang loss queues
Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are (i) classical circuit switch telephone networks (loss networks) and (ii) present-day wireless mobile networks. Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this st...
متن کاملA short note on the monotonicity of the Erlang C formula in the Halfin-Whitt regime
We prove a monotonicity condition satisfied by the Erlang C formula when computed in the Halfin-Whitt regime. This property was recently conjectured in Janssen et al. [2011]. Recently, there has been a renewed interest in the Erlang C formula (1) C(n, a) = an n!(1− ρ) ( n−1 ∑ k=0 ak k! + an n!(1− ρ) )−1 , that gives the probability of waiting for an arriving customers to an M/M/n system whose t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 2009